Strengthening lattice-free cuts using non-negativity
نویسندگان
چکیده
Abstract In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2007) and Borozan and Cornuéjols (2007) study sets defined by equations that contain exactly one integer variable per row. The integer variables are not restricted in sign. Cutting planes based on this approach have already been computationally studied by Espinoza [15] for general mixed-integer problems and there is ongoing computational research in this area. In this paper, we extend the model studied in the earlier papers and require the integer variables to be non-negative. We extend the results in Andersen et al. (2007) and Borozan and Cornuéjols (2007) to our case and show that cuts generated by their approach can be strengthened by using the non-negativity of the integer variables. In particular, it is possible to obtain cuts which have negative coefficients for some variables.
منابع مشابه
On the Practical Strength of Two-Row Tableau Cuts
Following the flurry of recent theoretical work on cutting planes from two-row mixed integer group relaxations of an LP tableau, we report on computational tests to evaluate the strength of two-row cuts based on lattice-free triangles having more than one integer point on one side. A heuristic procedure to generate such triangles (referred to in the literature as “type 2” triangles) is presente...
متن کاملTwo dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
In this paper, we study the relationship between 2D lattice-free cuts, the family of cuts obtained by taking two-row relaxations of a mixed-integer program (MIP) and applying intersection cuts based on maximal lattice-free sets in R, and various types of disjunctions. Recently, Li and Richard (2007) studied disjunctive cuts obtained from t-branch split disjunctions of mixed-integer sets (these ...
متن کاملComputing with Multi-Row Intersection Cuts
Cutting planes are one of the main techniques currently used to solve large-scale MixedInteger Linear Programming (MIP) models. Many important cuts used in practice, such as Gomory Mixed-Integer (GMI) cuts, are obtained by solving the linear relaxation of the MIP, extracting a single row of the simplex tableau, then applying integrality arguments to it. A natural extension, which has received r...
متن کاملTwo row mixed-integer cuts via lifting
Recently Andersen et al. [1], Borozan and Cornuéjols [6] and Cornuéjols and Margot [10] have characterized the extreme valid inequalities of a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal lattice-free convex sets. In order to use these inequ...
متن کاملLifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
Recently, Andersen et al. [1] and Borozan and Cornuéjols [3] characterized the minimal inequalities of a system of two rows with two free integer variables and nonnegative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal lattice-free convex sets. In order to use these minimal inequalities to obtain cuts from two rows of a general simplex ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Optimization
دوره 8 شماره
صفحات -
تاریخ انتشار 2011